Rational Functions with a Polynomial Iterate
نویسندگان
چکیده
منابع مشابه
Enumeration of almost polynomial rational functions with given critical values
Enumerating ramified coverings of the sphere with fixed ramification types is a well-known problem first considered by A. Hurwitz [5]. Up to now, explicit solutions have been obtained only for some families of ramified coverings, for instant, those realized by polynomials in one complex variable. In this paper we obtain an explicit answer for a large new family of coverings, namely, the coverin...
متن کاملThe best uniform polynomial approximation of two classes of rational functions
In this paper we obtain the explicit form of the best uniform polynomial approximations out of Pn of two classes of rational functions using properties of Chebyshev polynomials. In this way we present some new theorems and lemmas. Some examples will be given to support the results.
متن کاملExact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
We present a hybrid symbolic-numeric algorithm for certifying a polynomial or rational function with rational coefficients to be non-negative for all real values of the variables by computing a representation for it as a fraction of two polynomial sum-ofsquares (SOS) with rational coefficients. Our new approach turns the earlier methods by Peyrl and Parrilo at SNC’07 and ours at ISSAC’08 both b...
متن کاملCharacterizing Polynomial Time Computability of Rational and Real Functions
Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the computational complexity of real functions defined over compact domains has been extensively studied. However, much less have been done for other kinds of real function...
متن کاملBest uniform polynomial approximation of some rational functions
This thesis is based on the following paper :Mehdi Dehghan , M.R. Eslahchi, Best uniform polynomialapproximation of some rational functions , Computers andMathematics with Applications ,Best polynomial approximation problem is one of the mostimportant and applicable subjects in the approxi References1. [1] J . C . Mason , D . C . Handscomb , Chebyshevpolynomials ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1996
ISSN: 0021-8693
DOI: 10.1006/jabr.1996.0054